Minimum norm differential approximation
نویسندگان
چکیده
منابع مشابه
Approximation in Uniform Norm by Solutions of Elliptic Differential Equations
Introduction. Let G be an open subset of the Euclidean w-space E, Gi an open subset with compact closure in G. If n = 2 and G is the whole of E, an important circle of theorems in the theory of analytic functions associated with the names of Walsh, HartogsRosenthal, Lavrentiev, Keldych, and Mergelyan deals with the possibility of approximating analytic functions on Gi continuous on its closure,...
متن کاملOn the Minimum Norm
This paper describes a new technique to nd the minimum norm solution of a linear program. The main idea is to reformulate this problem as an unconstrained minimization problem with a convex and smooth objective function. The minimization of this objective function can be carried out by a Newton-type method which is shown to be globally convergent. Furthermore, under certain assumptions, this Ne...
متن کاملParsimonious Least Norm Approximation
A theoretically justiiable fast nite successive linear approximation algorithm is proposed for obtaining a parsimonious solution to a corrupted linear system Ax = b + p, where the corruption p is due to noise or error in measurement. The proposed linear-programming-based algorithm nds a solution x by parametrically minimizing the number of nonzero elements in x and the error k Ax ? b ? p k 1. N...
متن کاملAll-Norm Approximation Algorithms
A major drawback in optimization problems and in particular in scheduling problems is that for every measure there may be a different optimal solution. In many cases the various measures are different lp norms. We address this problem by introducing the concept of an All-norm ρ-approximation algorithm, which supplies one solution that guarantees ρ-approximation to all lp norms simultaneously. S...
متن کاملGuaranteed Minimum Rank Approximation from Linear Observations by Nuclear Norm Minimization with an Ellipsoidal Constraint
The rank minimization problem is to find the lowest-rank matrix in a given set. Nuclear norm minimization has been proposed as an convex relaxation of rank minimization. Recht, Fazel, and Parrilo have shown that nuclear norm minimization subject to an affine constraint is equivalent to rank minimization under a certain condition given in terms of the rank-restricted isometry property. However, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1976
ISSN: 0022-247X
DOI: 10.1016/0022-247x(76)90153-0